A complete algorithm for designing passive fences to orient parts

Peshkin and Sanderson showed that parts can be aligned as they move on a conveyor belt against a pass ive sequence of fences In this paper we describe the rst complete algorithm to design such sequences for a given convex polygonal part The algorithm is com plete in the sense that it is guaranteed to nd a design if one exists and to terminate with a negative report oth erwise Based on an exact breadth rst search of the design space the algorithm is also guaranteed to nd the design requiring the fewest fences We describe the algorithm and compare results with those previously re ported We conjecture that a fence design exists to ori ent any convex polygonal part